A Closer Look at Serial Growth Rate Correlation
نویسندگان
چکیده
منابع مشابه
A Closer Look at Serial Growth Rate Correlation
Serial correlation in annual growth rates carries a lot of information on growth processes – it allows us to directly observe firm performance as well as to test theories. Using a 7-year balanced panel of 10 000 French manufacturing firms, we observe that small firms typically are subject to negative correlation of annual growth rates, whereas larger firms display positive correlation. Furtherm...
متن کاملwww.econstor.eu A Closer Look at Serial Growth Rate Correlation
Serial correlation in annual growth rates carries a lot of information on growth processes – it allows us to directly observe firm performance as well as to test theories. Using a 7-year balanced panel of 10 000 French manufacturing firms, we observe that small firms typically are subject to negative correlation of annual growth rates, whereas larger firms display positive correlation. Furtherm...
متن کاملCloser Look at the Baseflow Correlation Method
In 2003, Reilly and Kroll examined the baseflow correlation method at river sites throughout the United States. The current study reexamines Reilly and Kroll’s baseflow correlation experiment by investigating the use of different performance metrics, experimental parameters, and model assumptions that were not investigated by Reilly and Kroll. The goal of this study is to provide additional gui...
متن کاملA Closer Look at Preduction
In a recent paper Jun Arima formalises the idea of preduc-tion { a non-monotonic schema providing a common basis for inductive and analogical reasoning. We examine some of the implications of this schema, as well as its connections with prototypes and conceptual spaces. A generalised version of his schema is motivated and developed to address diiculties with asymmetry and disjuncts.
متن کاملA Closer Look at HMAC
Bellare, Canetti and Krawczyk [BCK96] show that cascading an ε-secure (fixed input length) PRF gives an O(εnq)-secure (variable input length) PRF when making at most q prefix-free queries of length n blocks. We observe that this translates to the same bound for NMAC (which is the cascade without the prefix-free requirement but an additional application of the PRF at the end), and give a matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Industrial Organization
سال: 2007
ISSN: 0889-938X,1573-7160
DOI: 10.1007/s11151-007-9135-y